Trade-oos in Routing Private Multicast Traac

نویسنده

  • Li Gong
چکیده

Multicast is a convenient and important mode of communication in internetworks, and there has been a number of studies on eecient routing of multicast traac. In particular , simulation has been performed to evaluate the trade-oos between source-speciic trees and shared trees, and between various routing algorithms. In this paper, we show that the consideration of security brings a new set of trade-oos in routing private multicast traac. We describe these trade-oos between security, trust, knowledge of group membership and of topology, types of multicast tree, bandwidth consumption, and latency. We propose four methods to improve eeciency: message pruning, message reprocessing , hot-start authentication, and continuous authentica-tion. This study of new trade-oos helps in choosing the appropriate multicast strategies for speciic applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Trade - o s of Multicast Trees and Algorithms 1

Multicast trees can be shared across sources (shared trees) or may be source-speciic (shortest path trees). Inspired by recent interests in using shared trees for interdomain multicasting, we investigate the trade-oos among shared tree types and source speciic shortest path trees, by comparing performance over both individual multicast group and the whole network. The performance is evaluated i...

متن کامل

A Comparison of Multicast Trees and Algorithms

Multicast trees can be shared across sources or may be source-speciic. Inspired by recent interests in using shared trees for interdomain mul-ticasting BFC93] WLE + 92], this paper investigates the trade-oos among diierent algorithms and tree types. Because of the dynamic nature of graphs, only worst case delay bounds can be calculated using analytical methods. We present simulation results ove...

متن کامل

Routing and Wavelength Assignment in All-Optical Networks with Multicast Traffic

In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in all-optical wavelength-routing networks with multicast traac. The RWA problem has been proved NP-hard. Many researchers are working on this problem and many algorithms have been proposed to solve the RWA problem. However, most of these algorithms only consider unicast traac, while with multicast traac, the blockin...

متن کامل

Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers

The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...

متن کامل

Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers

We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995